Finding Strongly Connected Components in a Social Network Graph
نویسندگان
چکیده
منابع مشابه
Strongly connected components-Algorithm for finding the strongly connected components of a graph
A directed graph G (V, E) is strongly connected if and only if, for any pair of vertices X and Y from V, there exists a path from X to Y and a path from Y to X. In Computer Science, the partition of a graph in strongly connected components is represented by the partition of all vertices from the graph, so that for any two vertices, X and Y, from the same partition, there exists a path from X to...
متن کاملOn Finding the Strongly Connected Components in a Directed Graph
We present two improved versions of Tarjan's algorithm for the detection of strongly connected components in a directed graph. Our new algorithms handle sparse graphs and graphs with many trivial components (containing only one node) more economically than Tarjan's original algorithm. As an application we present an eecient transitive closure algorithm.
متن کاملFinding strongly connected components in distributed graphs
The traditional, serial, algorithm for finding the strongly connected components in a graph is based on depth first search and has complexity which is linear in the size of the graph. Depth first search is difficult to parallelize, which creates a need for a different parallel algorithm for this problem. We describe the implementation of a recently proposed parallel algorithm that finds strongl...
متن کاملStrongly Connected Components in Graph Streams
Frequently studied networks, such as social networks, are often massive, directed, and change over time. Thus studying network analysis algorithms in terms of data streaming is a practical model for understanding how companies and other organizations can process data in a useful, realistic way. One potentially interesting feature of a directed graph is strongly connected components. We design a...
متن کاملA space-efficient algorithm for finding strongly connected components
Tarjan’s algorihm for finding the strongly connected components of a directed graph is widely used and acclaimed. His original algorithm required at most v(2 + 5w) bits of storage, where w is the machine’s word size, whilst Nuutila and Soisalon-Soininen reduced this to v(1 + 4w). Many real world applications routinely operate on very large graphs where the storage requirements of such algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2016
ISSN: 0975-8887
DOI: 10.5120/ijca2016908481